#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#define MAXN 505
#define MAXM 100005
using namespace std;

int n;

int len(int k){
    int x;
    if (k == -1) return 0;
    x = len(k - 1);
    return x + k + 3 + x;
}

char solve(int n, int k){
    if (n > len(k)) return solve(n, k+1);
    if (n <= len(k-1)) return solve(n, k-1);
    n = n - len(k-1);
    if (n <= k + 3)
        return n == 1 ? 'm' : 'o';
    n = n - (k+3);
    return solve(n, k - 1);
}

int main()
{
    freopen("moo.txt","r", stdin);
    scanf("%d", &n);
    printf("%c\n", solve(n, 0));
    return 0;
}
